Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
نویسندگان
چکیده
منابع مشابه
Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
Three equivalence relations are considered on the set of n x n matrices with elements in Fo' an · abelian group with absorbing zero adjoined. They are the relations of diagonal similarity, diagonal equivalence, and restricted diagonal equivalence. These relations are usually considered for matrices with elements in a field, but only multiplication is involved. Thus our formulation in terms of a...
متن کاملDiagonal Similarity and Equivalence for Matrices
the cyclic products of matrices and diagonal similarity. In this paper we consider diagonal similarity for matrices, which may be infinite, and whose elements lie in a (possible non-commutative) group G with O. Let H be a subgroup of a group G and let A be an irreducible square matrix with entries in GO. In Theorem 3.4, we give necessary and sufficient conditions for the existence of a matrix B...
متن کاملOne-sided simultaneous inequalities and sandwich theorems for diagonal similarity and diagonal equivalence of nonnegative matrices
Results on the simultaneous scaling of nonnegative matrices involving one sided inequalities are presented. These are applied to scalings involving two sided inequalities. The proofs are graph theoretic. The setting is generalized to matrices with elements in lattice ordered Abelian groups with 0.
متن کاملEla One-sided Simultaneous Inequalities and Sandwich Theorems for Diagonal Similarity and Diagonal Equivalence of Nonnegative Matrices∗
Results on the simultaneous scaling of nonnegative matrices involving one sided inequalities are presented. These are applied to scalings involving two sided inequalities. The proofs are graph theoretic. The setting is generalized to matrices with elements in lattice ordered Abelian groups with 0.
متن کاملBlock Diagonal Matrices
For simplicity, we adopt the following rules: i, j, m, n, k denote natural numbers, x denotes a set, K denotes a field, a, a1, a2 denote elements of K, D denotes a non empty set, d, d1, d2 denote elements of D, M , M1, M2 denote matrices over D, A, A1, A2, B1, B2 denote matrices over K, and f , g denote finite sequences of elements of N. One can prove the following propositions: (1) Let K be a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1978
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90200-5